Model Checking. Part I
نویسندگان
چکیده
منابع مشابه
Model Checking. Part II
(Def. 1) CastNatx = { x, if x is a natural number, 0, otherwise. Let W1 be a set. A sequence of W1 is a function from N into W1. For simplicity, we use the following convention: k, n denote natural numbers, a denotes a set, D, S denote non empty sets, and p, q denote finite sequences of elements of N. Let us consider n. The functor atom. n yields a finite sequence of elements of N and is define...
متن کاملModel Checking . Part III Kazuhisa
This text includes verification of the basic algorithm in Simple On-the-fly Automatic Verification of Linear Temporal Logic (LTL). LTL formula can be transformed to Buchi automaton, and this transforming algorithm is mainly used at Simple On-the-fly Automatic Verification. In this article, we verified the transforming algorithm itself. At first, we prepared some definitions and operations for t...
متن کاملA Verification Environment for I / O Automata – Part II : Theorem Proving and Model Checking – Olaf
We describe a veriication framework for I/O automata in Isabelle. It includes a temporal logic, proof support for showing implementation relations between live I/O automata, and a combination of Isabelle with model checking via a veriied abstraction theory. The underlying domain-theoretic sequence model turned out to be especially adequate for these purposes. Furthermore, using a tailored combi...
متن کاملI/O Efficient Directed Model Checking
Directed model checking has proved itself to be a useful technique in reducing the state space of the problem graph. But still, its potential is limited by the available memory. This problem can be circumvented by the use of secondary storage devices to store the state space. This paper discusses directed best-first search to enhance error detection capabilities of model checkers like SPIN by u...
متن کاملLtl Model Checking with I/o-efficient Accepting Cycle Detection Ltl Model Checking with I/o-efficient Accepting Cycle Detection
We show how to adopt existing non-DFS-based algorithm OWCTY [ČP03] for accepting cycle detection to the I/O efficient setting and compare the I/O efficiency and practical performance of the adopted algorithm to the existing I/O efficient LTL model checking approach of Edelkamp et al. [EJ06]. We show that while the new algorithm exhibits similar I/O complexity with respect to the size of the gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2006
ISSN: 1898-9934,1426-2630
DOI: 10.2478/v10037-006-0021-0